| |
| description |
12 pages
|
|
In this paper we investigate optimal points of time for task
assignment in dynamic load balancing schemes. Normally final
assignment of tasks to server queues is made at the latest possible
time. The main reason for a late assignment is, that a dynamic load
balancer can use most recent information about system and
application state for the decision. In general however, assignment
can be done at task arrival time, at the moment when a processor or
server becomes idle, or when significant load changes in the system
occur. We will elaborate preconditions and circumstances for
situations, where it is advantageous to assign tasks earlier than
necessary, i.e. to queue them at the servers. We verify the results
in an experimental load balancing environment.
|
| publisher |
Stuttgart, Germany, Universität Stuttgart
|
| type |
Text
|
| Technical Report
|
| source |
ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/TR-1994-09/TR-1994-09.pdf
|
| contributor |
Anwendersoftware (Prof. Reuter) (IPVR)
|
| format |
application/pdf
|
| subject |
Distributed Systems (CR C.2.4)
|
| Performance of Systems (CR C.4)
|
| Operating Systems Performance (CR D.4.8)
|
| relation |
Technical Report No. 1994/09
|